New upper bounds on separating codes - Telecommunications, 2003. ICT 2003. 10th International Conference on

نویسندگان

  • GBrard Cohen
  • Hans Georg Schaathun
چکیده

Separating codes, initially introduced to test au tomaton , have revived lately in t h e s t u d y of f ingerprint ing codes, which are used for copyr ight protect ion. Separating codes play the i r role i n making t h e fiugerpr in t ing scheme secu re agains coalitions of pirates. We provide h e r e better bounds o n such codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introducing 'space' into space-time MIMO capacity calculations: a new closed form upper bound - Telecommunications, 2003. ICT 2003. 10th International Conference on

We present a new upper bound on capacity for multipleinput multiple-output (MIMO) wireless fading channels which is more general and realistic than previous capacity expressions. By including spatial information at the antenna arrays we derive a closed form upper bound on capacity which uses the physics of signal propagation combined with statistics of the scattering environment. This expressio...

متن کامل

Upper Bounds on the Number of Codewords of Some Separating Codes

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture f...

متن کامل

Bounds on Linear Codes for Network Multicast

Traditionally, communication networks are composed of routing nodes, which relay and duplicate data. Work in recent years has shown that for the case of multicast, an improvement in both rate and code-construction complexity can be gained by replacing these routing nodes by linear coding nodes. These nodes transmit linear combinations of the inputs transmitted to them. In this work, we deal wit...

متن کامل

New Bounding Techniques for Channel Codes over Quasi - Static Fading Channels

New Bounding Techniques for Channel Codes over Quasi-static Fading Channels. (August 2003) Jingyu Hu, B.E., Shanghai Jiao Tong University, P.R.China Chair of Advisory Committee: Dr. Scott L. Miller This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008